Mining λ-Maximal Cliques from a Fuzzy Graph
نویسندگان
چکیده
The depletion of natural resources in the last century now threatens our planet and the life of future generations. For the sake of sustainable development, this paper pioneers an interesting and practical problem of dense substructure (i.e., maximal cliques) mining in a fuzzy graph where the edges are weighted by the degree of membership. For parameter 0 ≤ λ ≤ 1 (also called fuzzy cut in fuzzy logic), a newly defined concept λ-maximal clique is introduced in a fuzzy graph. In order to detect the λ-maximal cliques from a fuzzy graph, an efficient mining algorithm based on Fuzzy Formal Concept Analysis (FFCA) is proposed. Extensive experimental evaluations are conducted for demonstrating the feasibility of the algorithm. In addition, a novel recommendation service based on an λ-maximal clique is provided for illustrating the sustainable usability of the problem addressed.
منابع مشابه
Finding All Maximal Cliques in Dynamic Graphs
Clustering applications dealing with perception based or biased data lead to models with non-disjunct clusters. There, objects to be clustered are allowed to belong to several clusters at the same time which results in a fuzzy clustering. It can be shown that this is equivalent to searching all maximal cliques in dynamic graphs like Gt = (V,Et), where Et−1 ⊂ Et, t = 1, . . . , T ;E0 = φ. In thi...
متن کاملMining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
We consider Maximal Clique Enumeration (MCE) from a large graph. A maximal clique is perhaps the most fundamental dense substructure in a graph, and MCE is an important tool to discover densely connected subgraphs, with numerous applications to data mining on web graphs, social networks, and biological networks. While effective sequential methods for MCE are known, scalable parallel methods for...
متن کاملAsymptotic Delsarte cliques in distance-regular graphs
We give a new bound on the parameter λ (number of common neighbors of a pair of adjacent vertices) in a distance-regular graph G, improving and generalizing bounds for strongly regular graphs by Spielman (1996) and Pyber (2014). The new bound is one of the ingredients of recent progress on the complexity of testing isomorphism of strongly regular graphs (Babai, Chen, Sun, Teng, Wilmes 2013). Th...
متن کاملExtracting of All Maximal Cliques: Monotone System Approach
NP-complicated problems have been described in the graph theory. An example is the extracting of all maximal cliques from a graph. Many algorithms for solving this problem have been described. However, complexity is linear to the number of maximal cliques. This paper discusses a new approach for extracting maximal cliques, based on the monotone system theory. The complexity of the presented alg...
متن کاملSchool of IT Technical Report DATA PREPARATION FOR MINING COMPLEX PATTERNS IN LARGE SPATIAL DATABASES
The aim of the thesis is to design an efficient algorithm for data preparation in large spatial databases for the purpose of data mining. With respect to finding complex spatial patterns, the raw data needs to be in the form converted into a set of cliques. In our case the raw data was a 1% sample from the Sloane Digital Sky Survey database which contains 818 Gigabytes of astronomical informati...
متن کامل